Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
نویسنده
چکیده
منابع مشابه
LP-relaxations for tree augmentation
In the Tree Augmentation problem the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T ∪ F is 2-edge-connected. The best approximation ratio known for the problem is 1.5. In the more general Weighted Tree Augmentation problem, F should be of minimum weight. Weighted Tree Augmentation admits several 2-approximation algorithms w.r.t. the standard cut-LP ...
متن کاملApproximating Minimum Cost Connectivity Orientation and Augmentation
Connectivity augmentation and orientation are two fundamental classes of problems related to graph connectivity. The former includes minimum cost spanning trees, k-edge-connected subgraph and more generally, survivable network design problems [9]. In the orientation problems the goal is to find orientations of an undirected graph that achieve prescribed connectivity properties such as global an...
متن کاملA Note on Eswaran and Tarjan's Algorithm for the Strong Connectivity Augmentation Problem
In a seminal paper Eswaran and Tarjan [1] introduced several augmentation problems and presented linear time algorithms for them. This paper points out an error in Eswaran and Tarjan's algorithm for the strong connectivity augmentation problem. Consequently, the application of their algorithm can result in a network that is not strongly connected. Luckily, the error can be fixed fairly easily, ...
متن کاملLoránd University Institute of Mathematics Ph . D . thesis Connectivity augmentation algorithms László Végh
The main subject of the thesis is connectivity augmentation: we would like to make a given graphk-connected by adding a minimum number of new edges. There are four basic problems in thisfield, since one might consider both edgeand node-connectivity augmentation in both graphsand digraphs. The thesis wishes to contribute to three out of these four problems: directed-and undirecte...
متن کاملConnectivity augmentation algorithms
The main subject of the thesis is connectivity augmentation: we would like to make a given graph k-connected by adding a minimum number of new edges. There are four basic problems in this field, since one might consider both edgeand node-connectivity augmentation in both graphs and digraphs. The thesis wishes to contribute to three out of these four problems: directedand undirected node-connect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 129 شماره
صفحات -
تاریخ انتشار 2003